Independent Sets In Association Schemes

نویسندگان

  • Chris D. Godsil
  • M. W. Newman
چکیده

Let X be k-regular graph on v vertices and let τ denote the least eigenvalue of its adjacency matrix A(X). If α(X) denotes the maximum size of an independent set in X, we have the following well known bound: α(X) ≤ v 1− k τ . It is less well known that if equality holds here and S is a maximum independent set in X with characteristic vector x, then the vector

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximal Independent Sets for the Pixel Expansion of Graph Access Structure

 Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...

متن کامل

MAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE

Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...

متن کامل

?-Independent and Dissociate Sets on Compact Commutative Strong Hypergroups

In this paper we define ?-independent (a weak-version of independence), Kronecker and dissociate sets on hypergroups and study their properties and relationships among them and some other thin sets such as independent and Sidon sets. These sets have the lacunarity or thinness property and are very useful indeed. For example Varopoulos used the Kronecker sets to prove the Malliavin theorem. In t...

متن کامل

Independent Sets and Eigenspaces

The problems we study in this thesis arise in computer science, extremal set theory and quantum computing. The first common feature of these problems is that each can be reduced to characterizing the independent sets of maximum size in a suitable graph. A second common feature is that the size of these independent sets meets an eigenvalue bound due to Delsarte and Hoffman. Thirdly, the graphs t...

متن کامل

Degrees of M-fuzzy families of independent L-fuzzy sets

The present paper studies fuzzy matroids in view of degree. First wegeneralize the notion of $(L,M)$-fuzzy independent structure byintroducing the degree of $M$-fuzzy family of independent $L$-fuzzysets with respect to a mapping from $L^X$ to $M$. Such kind ofdegrees is proved to satisfy some axioms similar to those satisfiedby $(L,M)$-fuzzy independent structure. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Combinatorica

دوره 26  شماره 

صفحات  -

تاریخ انتشار 2006